Inverse Minimum Cut Problem with Lower and Upper Bounds
نویسندگان
چکیده
منابع مشابه
Upper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملSome upper and lower bounds on the coupon collector problem
The classical coupon collector problem is closely related to probabilistic-packet-marking (PPM) schemes for IP traceback problem in the Internet. In this paper, we study the classical coupon collector problem, and derive some upper and lower bounds of the complementary cumulative distribution function (ccdf) of the number of objects (coupons) that one has to check in order to detect a set of di...
متن کاملLower and Upper Bounds for the Master Bay Planning Problem
In this work we tackle the problem of the stowage of containers on a ship, the so-called Master Bay Planning Problem (MBPP). This is an important hard combinatorial optimization problem in the context of maritime port logistics which has proven to be really difficult to solve. We propose two new lower bounds and two new upper bounds which are useful to solve it. In order to test both the effici...
متن کاملImproved upper and lower bounds for the point placement problem
The point placement problem is to determine the positions of a set of n distinct points, P = {p1, p2, p3, . . . , pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points. Each distance query corresponds to an edge in a graph, called point placement graph (ppg), whose vertex set is P . The uniqueness requirement of the placemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8091494